An Ant-Based Routing Algorithm to Achieve the Lifetime Bound for Target Tracking Sensor Networks
نویسندگان
چکیده
We consider the maximum lifetime routing problem for target tracking sensor network. The goal is to find the optimal routing to not only maximize the lifetime of the network but also provide real-time data transmission services. We first propose a novel model to formally define the lifetime of target tracking sensor network by establishing the relationship between individual sensors and the whole sensor network. In this model, we derive the key factor in routing that determines the lifetime bound. Then, considering this factor, we discuss the implementation of an ant-based routing algorithm. Preliminary result demonstrates the appealing performance of our proposed scheme.
منابع مشابه
Combining Harmony search algorithm and Ant Colony Optimization algorithm to increase the lifetime of Wireless Sensor Networks
Wireless Sensor Networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as Wireless. The main goal of these networks is collecting data from neighboring environment of network sensors. Since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملRAWSN: A Routing Algorithm Based on Auxiliary Nodes to Reduce Energy Consumption in Wireless Sensor Networks
In this paper, an algorithm , based on genetics and auxiliary nodes, to reduce energy consumption in wireless sensor networks has been presented. In this research, by considering some parameters as energy and distance, a target function has been created, which is more optimum comparing to other methods. In this research cluster head is selected by genetic algorithm. In RAWSN algorithm a new tec...
متن کاملA Hierarchy Topology Design Using a Hybrid Evolutionary Algorithm in Wireless Sensor Networks
Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...
متن کاملTarget Tracking with Unknown Maneuvers Using Adaptive Parameter Estimation in Wireless Sensor Networks
Abstract- Tracking a target which is sensed by a collection of randomly deployed, limited-capacity, and short-ranged sensors is a tricky problem and, yet applicable to the empirical world. In this paper, this challenge has been addressed a by introducing a nested algorithm to track a maneuvering target entering the sensor field. In the proposed nested algorithm, different modules are to fulfill...
متن کامل